USER'S GUIDE

  • AIMMS Basics
  • Creating and Managing a Model
  • Data Management
  • AIMMS and Solvers
    • AIMMS IDE
    • Baron
    • CBC
      • CBC
      • CBC to AIMMS Mapping
      • AIMMS to CBC Mapping
      • CBC Options
        • General
        • Barrier
        • MIP
        • MIP Cuts
        • MIP Heuristics
        • Presolve
        • Simplex
        • Logging
    • CONOPT
    • COPT
    • CP Optimizer
    • CPLEX
    • GUROBI
    • IPOPT
    • KNITRO
    • MINOS
    • ODH-CPLEX
    • PATH
    • SNOPT
    • XA
    • CompLis
  • Miscellaneous
User's Guide
AIMMS Logo
  • User's Guide »
  • AIMMS and Solvers »
  • CBC »
  • CBC Options »
  • MIP Heuristics »
  • Proximity search
  • Edit on Github

Proximity search

Type : Selection

Range : The settings listed below

Default : Off

This option controls the use of the ”No-Neighborhood Search” 0-1 MIP refinement heuristic proposed by Fischetti and Monaci (2012). The idea is to define a sub-MIP without additional constraints but with a modified objective function intended to attract the search in the proximity of the incumbent. The approach works well for 0-1 MIPs whose solution landscape is not too irregular (meaning the there is reasonable probability of finding an improved solution by flipping a small number of binary variables), in particular when it is applied to the first heuristic solutions found at the root node.

Possible values are:

  • Off

  • On

Last updated: Aug 06, 2025

Help & Feedback

Docs

Edit this page to fix an error or add an improvement in a pull request
Create an issue to suggest an improvement to this page

Product

Create a topic if there's something you don't like about this feature
Propose functionality by submitting a feature request

Support

Not what you where looking for? Search the docs

Remember we also have Community support

Still having trouble ? Reach out to us


Next Previous

AIMMS
AIMMS COMMUNITY
AIMMS DOCS
DISCLAIMER
PRIVACY STATEMENT
© 1989 - 2025 AIMMS B.V.